Drags: A compositional algebraic framework for graph rewriting
نویسندگان
چکیده
منابع مشابه
A Graph Rewriting Framework for Statecharts Semantics
The purpose of the paper is to show that graph rewriting is a suitable environment to formalize semantics of speciication languages with dynamic features. This is exempliied considering Statecharts in a variant allowing dynamic creation of processes. Graph rewriting rules give the semantics of Statecharts in such interpretation. Standard Stat-echarts semantics can be recovered by suitably restr...
متن کاملAlgebraic Graph Rewriting Using a Single Pushout
We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.
متن کاملAn Algebraic Framework for Compositional Program Analysis
The purpose of a program analysis is to compute an abstract meaning for a program which approximates its dynamic behaviour. A compositional program analysis accomplishes this task with a divide-and-conquer strategy: the meaning of a program is computed by dividing it into sub-programs, computing their meaning, and then combining the results. Compositional program analyses are desirable because ...
متن کاملThe Contractum in Algebraic Graph Rewriting
Algebraic graph rewriting, which works by first removing the part of the graph to be regarded as garbage, and then gluing in the new part of the graph, is contrasted with term graph rewriting, which works by first gluing in the new part of the graph (the contractum) and performing redirections, and then removing garbage. It is shown that in the algebraic framework these two strategies can be re...
متن کاملModelling Software Evolution using Algebraic Graph Rewriting
We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the relations in UML interaction diagrams. Then, we provide a set of algebraic graph rewrite rules tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.01.029